Fault-Tolerant Approximate BFS Structures
نویسندگان
چکیده
منابع مشابه
A Fault Tolerant Approximate BFS Structures
A fault-tolerant structure for a network is required to continue functioning following the failure of some of the network’s edges or vertices. This paper addresses the problem of designing a fault-tolerant (α, β) approximate BFS structure (or FT-ABFS structure for short), namely, a subgraph H of the network G such that subsequent to the failure of some subset F of edges or vertices, the survivi...
متن کاملFault Tolerant Approximate BFS Trees
A fault-tolerant structure for a network is required to continue functioning following the failure of some of the network’s edges or vertices. This paper addresses the problem of designing a fault-tolerant (α, β) approximate BFS tree (or FT-ABFS tree for short), namely, a subgraph H of the given network G such that subsequent to the failure of a single edge, the surviving part of H still contai...
متن کاملSparse Fault-Tolerant BFS Trees
A fault-tolerant structure for a network is required to continue functioning following the failure of some of the network’s edges or vertices. This paper considers breadth-first search (BFS) spanning trees, and addresses the problem of designing a sparse fault-tolerant BFS tree, or FT-BFS tree for short, namely, a sparse subgraph T of the given network G such that subsequent to the failure of a...
متن کاملMultiple Source Dual Fault Tolerant BFS Trees
Let G = (V,E) be a graph with n vertices and m edges, with a designated set of σ sources S ⊆ V . The fault tolerant subgraph for any graph problem maintains a sparse subgraph H = (V,E) of G with E ⊆ E, such that for any set F of k failures, the solution for the graph problem on G\F is maintained in its subgraph H \F . We address the problem of maintaining a fault tolerant subgraph for computing...
متن کاملFault-Tolerant Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been corrupted by a constant fraction of errors. This model is the common generalization of (static) data structures and locally decodable error-correcting codes. The m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2018
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3022730